Search Results/Filters    

Filters

Year

Banks




Expert Group











Full-Text


Issue Info: 
  • Year: 

    2019
  • Volume: 

    14
  • Issue: 

    1
  • Pages: 

    81-93
Measures: 
  • Citations: 

    0
  • Views: 

    247
  • Downloads: 

    187
Abstract: 

In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free R-submodules of a finite quasi-Frobenius ring R which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Gr¨ obner basis and we show that under certain conditions a linear code takes the maximum of minimum Hamming weight.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 247

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 187 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2015
  • Volume: 

    8
Measures: 
  • Views: 

    154
  • Downloads: 

    68
Abstract: 

GIVEN A NETWORK G(V, A, C), THE ECCENTRIC NODE OF A NODE U Î V IS THE FARTHEST NODE FROM U WITH RESPECT TO THE EDGE LENGTH VECTOR C. THE INVERSE ECCENTRIC PROBLEM CONSISTS OF MODIFYING THE EDGE LENGTH VECTOR C MINIMALLY SO THAT A SPECIFIC NODE T BECOMES THE ECCENTRIC NODE OF ANOTHER SPECIFIC NODE S. THE LENGTH MODIFICATIONS CAN BE MEASURED BY DIFFERENT distanceS. IN THIS PAPER, THE PROBLEM UNDER THE WEIGHTED SUM-TYPE Hamming distance IS CONSIDERED WHEN THE NETWORK IS A TREE. IT IS SHOWN THAT THE PROBLEM IS NP-HARD. THEN, A POLYNOMIAL-TIME ALGORITHM IS PRESENTED FOR A SPECIAL CASE OF THE PROBLEM.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 154

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 68
Issue Info: 
  • Year: 

    1390
  • Volume: 

    1
Measures: 
  • Views: 

    400
  • Downloads: 

    0
Abstract: 

در این تحقیق به منظور انتخاب بهترین الگوریتم برای طبقه بندی تصاویر ETM+ ماهواره لندست و تهیه نقشه جنگل در جنگل های آرمرده بانه سه الگوریتم minimum distance،  Maximum Liklihoodو Parallel epiped مورد بررسی قرار گرفتند. در این تحقیق از نسبت گیری های طیفی استفاده و باندهای مصنوعی مختلفی تهیه شدند. سپس مجموعه های باندی بدست آمده با استفاده از 3 الگوریتم ذکر شده طبقه بندی شدند. پس از عمل طبقه بندی به ارزیابی صحت نتایج با استفاده از ضریب های صحت کلی و ضریب کاپا، مقادیر صحت تولید کننده، صحت کاربر و خطای Ommission و Commission پرداخته شد. نتایج تحقیق نشان داد که الگوریتم Maximum Liklihood دارای بالاترین صحت برای طبقه بندی تصاویر ماهواره ای و تهیه نقشه جنگل می باشد.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 400

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0
Author(s): 

DEYPIR M.

Issue Info: 
  • Year: 

    2023
  • Volume: 

    10
  • Issue: 

    2
  • Pages: 

    81-90
Measures: 
  • Citations: 

    0
  • Views: 

    83
  • Downloads: 

    19
Abstract: 

Nowadays, Android-based devices such as smart phones, tablets, and recently virtual reality headsets have found increasing usage in our daily lives. Along with the development of software for these devices, new malicious applications are released by intruders, which are more difficult to identify and deal with because they use more sophisticated methods. Although methods have been provided to calculate the security risk and identify malicious apps, but with the expansion of the level and depth of their threats, the need for new methods in this field is still required. In this study, we have presented a new algorithm to calculate the security risk of Android apps, which can be used to identify malicious apps from benign ones. In this algorithm, to estimate the security risk of an input app, the nearest neighbors of the type of malicious apps and the nearest neighbors of the type of normal apps are determined separately using Hamming distance. Then, based on the criteria presented in this article, the security risk of an unknown input app can be computed. After implementing this algorithm and adjusting the parameter of the number of neighbors with the help of real data, extensive various experiments were conducted in order to evaluate the proposed method. In these experiments, the proposed method was compared with three previously known methods in the context of detecting malicious apps, using four different datasets. The results show the higher detection rate of the proposed method in most cases.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 83

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 19 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

Azad Hampa B. | BAROUGHI F.

Issue Info: 
  • Year: 

    2022
  • Volume: 

    19
  • Issue: 

    2 (73)
  • Pages: 

    77-91
Measures: 
  • Citations: 

    0
  • Views: 

    84
  • Downloads: 

    0
Abstract: 

The max+sum spanning tree problem is to find a spanning tree T* which makes the combined weight “, max w(e)+Sum c(e) time”,as small as possible, in which a weight w(e) and a cost c(e) are prescribed for each e ͼ, T. The problem can be solved in O(mlog n) time. In an inverse max+sum spanning tree problem, T0 is a given spanning tree of G, which is not an optimal max+sum spanning tree. Then we modify the weight vector w to w̅,so that T0 becomes a max+sum spanning tree. The goal is to minimize the modification cost ||w̅,-w||under Hamming distance. This paper presents a new solution algorithm for the inverse max+sum spanning tree problem under weighted sum-type Hamming distance by modifying the max-weight vector with time complexity of O(mlog n). First, we formulate the problem and then present a new solution algorithm for the problem under investigation. Finally, we present a numerical example to illustrate the efficiency of the algorithm.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 84

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

Azad Hampa B. | Baroughi F.

Issue Info: 
  • Year: 

    2022
  • Volume: 

    19
  • Issue: 

    2
  • Pages: 

    77-91
Measures: 
  • Citations: 

    0
  • Views: 

    67
  • Downloads: 

    9
Abstract: 

The max+sum spanning tree problem is to find a spanning tree T* which makes the combined weight “max w(e)+Sum c(e) time” as small as possible, in which a weight w(e) and a cost c(e) are prescribed for each e ͼT. The problem can be solved in O(mlog n) time. In an inverse max+sum spanning tree problem, T0 is a given spanning tree of G, which is not an optimal max+sum spanning tree. Then we modify the weight vector w to w̅ so that T0 becomes a max+sum spanning tree. The goal is to minimize the modification cost ||w̅-w||under Hamming distance. This paper presents a new solution algorithm for the inverse max+sum spanning tree problem under weighted sum-type Hamming distance by modifying the max-weight vector with time complexity of O(mlog n). First, we formulate the problem and then present a new solution algorithm for the problem under investigation. Finally, we present a numerical example to illustrate the efficiency of the algorithm.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 67

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 9 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2019
  • Volume: 

    6
  • Issue: 

    1
  • Pages: 

    67-84
Measures: 
  • Citations: 

    0
  • Views: 

    225
  • Downloads: 

    92
Abstract: 

In this article, we shall study the structure of (a + bu)􀀀 constacyclic codes of arbitrary length over the ring R = Fq + uFq +    + ue− 1Fq, where ue = 0, q is a power of a prime number p and a; b are non-zero elements of Fq. Also we shall nd a minimal spanning set for these codes. For a constacyclic code C we shall determine its minimum Hamming distance with some properties of Tor(C) as an a􀀀 constacyclic code over Fq.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 225

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 92 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

DASKALOV R.N. | GULLIVER T.A.

Issue Info: 
  • Year: 

    2001
  • Volume: 

    36
  • Issue: 

    -
  • Pages: 

    175-191
Measures: 
  • Citations: 

    1
  • Views: 

    167
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 167

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2016
  • Volume: 

    1
Measures: 
  • Views: 

    274
  • Downloads: 

    149
Abstract: 

PRIMARY GOAL OF ANY UTILITY IS TO PLAN AND MANAGE THE USE OF FACILITIES TO DELIVER A COMMODITY SUCH AS WATER, NATURAL GAS, OR ELECTRICITY TO ITS CUSTOMERS. GIS IS USED FOR MONITORING AND PLANNING POWER GENERATION RESOURCES. SOPHISTICATED SPATIAL ANALYSIS IS USEFUL FOR DETERMINING OPTIMUM GENERATION, DISTRIBUTION, STUDYING ENVIRONMENTAL IMPACT, AND MANAGING FACILITY ASSETS. GIS IS USED TO SPATIALLY ANALYZE NETWORK CONGESTION, CONSIDER GROWTH OPPORTUNITIES FOR RENEWABLE ENERGY SOURCES, DETERMINE SITE FEASIBILITY, AND CREATE ENERGY RESOURCE MARKET SCENARIOS. NETWORK ANALYSIS HAS A STRONG THEORETICAL BASIS IN THE MATHEMATICAL DISCIPLINES OF GRAPH THEORY AND TOPOLOGY, AND IT IS THE TOPOLOGICAL RELATIONSHIPS INHERENT IN NETWORKS THAT LED TO REVOLUTIONARY ADVANCES IN GIS DATA STRUCTURES. POWER COMPANIES ARE USING NEW BUSINESS STRATEGIES TO BETTER MANAGE AND IMPROVE SERVICE. IN THE REGONAL ELETRICAL COMPANY OF AZARBAYJAN LIKE OTHER COMPANIES AROUND THE WORLD IN THE FIRST STEP REQUIRED SPATIAL DATA COLLECTED AND PREPARED FOR GDB CONSTRUCTION ACCORDING TO THE CONCEPTUAL MODELS WHICH STRUCTURED BY GOVERNMENTAL POWER SUPERVISOR COMPANY (TAVANIR CO). CONSIDERING THE NECESSITY OF KEEPING THE GDB UP TO DATE, THIS STUDY HAS ANALYSED THE METHODOLOGIES BY WHICH IT COULD BE POSSIBLE TO QUANTIFY THE OPTIMAL LENGTH OF TRANSMITION ROADS TO ACCESS TO THE ELECTRICAL ENTITIES FOR INSTANCE SUBSTITUTIONS, ETC AND TO AUTOMATICALLY VISUALISE THE RELATED RECOMMENDED ROUTES.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 274

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 149
Author(s): 

APARICIO J. | RUIZ J.L.

Issue Info: 
  • Year: 

    2007
  • Volume: 

    28
  • Issue: 

    3
  • Pages: 

    209-218
Measures: 
  • Citations: 

    4
  • Views: 

    203
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 203

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 4 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button